Multiple-Valued Logic in FPGAs

نویسندگان

  • Zeljko Zilic
  • Zvonko G. Vranesic
چکیده

This paper considers the applicability of multiple-valued logic (MVL) circuits in implementation of field-programmable gate arrays (FPGAs). It proposes an FPGA logic block architecture that features MVL current-mode CMOS circuitry. The logic block combines the lookup-table and multiplexer approaches found in commercial FPGAs, and provides additional versatility through its current-mode operation. 1.0 Introduction Field Programmable Gate Arrays (FPGAs) are rapidly becoming a popular choice for implementation of digital circuits where quick turn-around time and low cost are important considerations. They are replacing the more traditional application-specific integrated circuits (ASICs) in a growing number of applications. The disadvantages of FPGAs are primarily due to lower density and speed, in comparison with ASICs and mask-programmable gate arrays. Both speed and density in FPGAs are affected by the structure of the logic blocks and the interconnect between them. The interconnect is of particular importance because it can occupy as much as 75 percent of the chip area [1], [4]. While all existing FPGAs are based on binary circuits, it is interesting to consider the possibility of using multiple-valued logic (MVL) circuits instead. In particular, it may be attractive to use current-mode CMOS technology for this purpose. Current-mode circuits may result in significant speed improvements, while the use of MVL signals may reduce the size of the interconnect. A recent study gives an example of improved speed in the case of a typical SRAM bit-line, where a delay was found to be 5 ns for conventional voltage-mode operation and less than 0.3 ns for current-mode signals [8]. This paper presents an attempt to investigate the possibility of exploiting MVL circuits in the FPGA environment. Its main purpose is to motivate future work in this direction, by discussing the feasibility of MVL logic blocks and their impact on the architecture of FPGAs. 2.0 Current-Mode MVL Circuits Recent experience shows that current-mode circuits are attractive for implementation of MVL functions. Most of the circuits and synthesis techniques in the literature have been intended for the 4-valued (quarternary) environment [2], [7]. Current-mode circuits offer several advantages, but they also have some disadvantages. Perhaps the most important advantage is the ease of summation of signals, while the main difficulty lies in the signal distribution limitations caused by the natural fanout being equal to one. In practice, it is useful to augment the current-mode circuits with some intermediate voltage-mode circuits, which often results in more effective designs. Figure 1 gives the basic blocks used in our design. All of these blocks have been used before [2], [7], [9]. Here, we will only summarize their characteristics. Currents are summed by means of a simple wired connection. Current sources are realized as an N-type or a P-type transistor with the gate connected to a reference voltage. The amount (value) of current is proportional to the ratio of W/L. Signal distribution can be performed using current mirrors, which can be of either N-type or P-type. We will use both types. The current produced at the output is determined by the input current and the ratio of the W/L values of output and input transistors. In addition to signal distribution, the current mirror can be used for multiplication with a constant and for sign reversal. A threshold detector block takes a multiple-valued input current signal and produces a voltage signal. The output signal is High if the input exceeds a predefined reference value; otherwise the output signal is Low. Threshold detectors generate signals that can be used with normal binary logic gates and for control of pass-transistor networks. A pass transistor is a voltage-controlled device, which enables or disables the current flow, depending on the gate voltage. We will use both N and P-type pass transistors. FIGURE 1. Basic Current Mode Blocks As an example of how these primitives are used, a converter from quaternary current mode to binary voltagemode signals is shown in Figure 2. The input current to the threshold comparators is distributed by the n-type current mirror. FIGURE 2. Quaternary to Binary Converter Name Log. Expression Symbol Circuit Realization

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Look-up Tables (LUTs) for Multiple-Valued, Combinational Logic

The use of Look-Up Tables (LUTs) is extended from binary to multiple-valued logic (MVL) circuits. A multiple-valued LUT can be implemented using both current-mode and voltage-mode techniques, reducing the transistor count to half compared to that of a binary implementation. Two main applications for multiple-valued LUTs are multiple-valued FPGAs and intelligent memories. An FPGA uses a LUT as a...

متن کامل

A Field-Programmable Digital Filter Chip Using Multiple-Valued Current-Mode Logic

This paper presents a Field-Programmable Digital Filter (FPDF) IC that employs carry-propagation-free redundant arithmetic algorithms for faster computation and multiplevalued current-mode circuit technology for high-density lowpower implementation. The original contribution of this paper is to evaluate, through actual chip fabrication, the potential impact of multiple-valued current-mode circu...

متن کامل

A Novel Design of Quaternary Inverter ‎Gate Based on GNRFET

   This paper presents a novel design of quaternary logic gates using graphene nanoribbon field effect transistors (GNRFETs). GNRFETs are the alternative devices for digital circuit design due to their superior carrier-transport properties and potential for large-scale processing. In addition, Multiple-valued logic (MVL) is a promising alternative to the conventional binary logic design. Sa...

متن کامل

Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...

متن کامل

TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS

In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993